Lecture 17 - Zero Knowledge Proofs
نویسنده
چکیده
Zero knowledge proofs were invented by Goldwasser, Micali and Rackoff in 82 (the paper, which we’ll call GMR, appeared in FOCS 85). Zero-knowledge proofs (and interactive proofs in general, also introduced in that paper) turned out to be one of the most beautiful and influential concepts in computer science, with applications ranging from practical signature schemes to proving that many NP-complete problems are hard even to approximate.
منابع مشابه
Lecture 14 - Zero Knowledge
Zero knowledge proofs were invented by Goldwasser, Micali and Rackoff in 82 (the paper, which we’ll call GMR, appeared in FOCS 85). Zero-knowledge proofs (and interactive proofs in general, also introduced in that paper) turned out to be one of the most beautiful and influential concepts in computer science, with applications ranging from practical signature schemes to proving that many NP-comp...
متن کاملProbabilistic Proof Systems Lecture Notes
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In these notes, we concentrate on three such proof systems | interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs. Remark: These are lecture notes in the strict sense of the word. Surveys of mine on this subject can be obtained from URL http...
متن کاملOn the Composition of Zero-Knowledge Proof Systems
The wide applicability of zero-knowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zero-knowledge protocols is zero-knowledge too. We demonstrate the limitations of the composition of zeroknowledge protocols by proving that the orig...
متن کاملDivertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented. Informally speaking, we call (A,B,C), a triplet of Turing machines, a divertible zero knowledge interactive proof, if (A,B) and (B,C) are zero knowledge interactive proofs and B converts (A,B) into (B,C) such that any evidence regarding the relationship between (A,B) and...
متن کاملLecture 19 : Zero Knowledge Proofs - Part 4 Instructor : Rafael Pass Scribe : Shentong Wang Review : Definition for Zero Knowledge
Review: Definition for Zero Knowledge As a review of the previous lecture, it was defined that (P ,V) is a Zero Knowledge proof for L with respect to RL if the following holds: 1. Soundness: ∀x ∈ L,∃y ∈ {0, 1}∗s.t.Pr[Outv[P (x, y) ↔ V (x)] = 1] = 1 2. Completeness: ∀P ∗,∀x 6∈ L, ∀y ∈ {0, 1}∗s.t.Pr[Outv[P ∗(x, y) ↔ V (x)] = 1] ≤ 2(n) 3. For all PPT V ∗, there exists an expected PPT S such that f...
متن کامل